Minimum Spanning Tree Algorithm

Parallel Minimum Spanning Tree Algorithm

The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...

A Probabilistic Minimum Spanning Tree Algorithm

Derivation of a Minimum Spanning Tree Algorithm

Image Registration with Minimum Spanning Tree Algorithm

Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphrepresentation method for image registration with Rényi entropy as the dissimilarity metric between images. The image matching is performed by minimizing the length of the minimum spanning tree (MST) which spans the graph gen...

An optimal minimum spanning tree algorithm

This thesis describes the optimal minimum spanning tree algorithm given by Pettie and Ramachandran (in Journal of the ACM, 2002). The algorithm presented finds a minimum spanning tree of a graph with n vertices and m edges deterministically in time O (T ∗ (m,n)), where T ∗ is the minimum number of edge-weight comparisons needed to determine the solution of the problem. The function T ∗ is the d...